Round-robin tournaments with limited resources

نویسندگان

چکیده

We propose a theoretical model of round-robin tournament with limited resources motivated by the fact that in real-world sport tournaments, participating teams are sometimes forced to distribute their effort over multiple matches. assume have amount must be distributed between all matches tournament. outcome each match as first-price all-pay auction. The prizes awarded according ranking at end tournament, based on number wins. three is solved. In case identical budgets and low first prize, we find two types equilibria—‘effort-saving’ ‘burning-out’—both leading unequal payoffs; when prize large, families equilibria both equal non-equal payoffs. non-identical budgets, show there exist where team lower budget gets higher payoff than larger budget.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Round-robin tournaments with homogeneous rounds

We study round-robin tournaments for n teams, where in each round a fixed number (g) of teams is present and each team present plays a fixed number (m) of matches in this round. In the tournament each match between two teams is either played once or twice, in the latter case in different rounds. We give necessary combinatorial conditions on the triples (n, g,m) for which such round-robin tourna...

متن کامل

Scheduling asynchronous round-robin tournaments

We study the problem of scheduling asynchronous round-robin tournaments. We consider three measures of a schedule that concern the quality and fairness of a tournament. We show that the schedule generated by the well-known “circle design” performs well with respect to all three measures when the number of teams is even, but not when the number of teams is odd. We propose a different schedule th...

متن کامل

Round robin tournaments and three index assignments

Scheduling a sports league can be seen as a difficult combinatorial optimization problem. We study some variants of round robin tournaments and analyze the relationship with the planar three-index assignment problem. The complexity of scheduling a minimum cost round robin tournament is established by a reduction from the planar three-index assignment problem. Furthermore, we introduce integer p...

متن کامل

First-mover advantage in round-robin tournaments

We study round-robin tournaments with either three or four symmetric players whose values of winning are common knowledge. In the round-robin tournament with three players there are three stages, each of which includes one match between two players. The player who wins in two matches wins the tournament. We characterize the sub-game perfect equilibrium and show that each player maximizes his ex...

متن کامل

Win Sequences for Round-robin Tournaments

Each of n teams numbered 1, 2, · · · , n play each of the other n− 1 teams exactly one time for a total of ( n 2 ) = n(n − 1)/2 games. Each game produces a win for one team and a loss for the other team. Define (wi, li), i = 1, 2, · · · , n, to be the win-loss records for the teams. That is, team i, i = 1, 2, · · · , n, wins wi games and loses li games where wi + li = n− 1. Of course, n ∑

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Choice and Welfare

سال: 2022

ISSN: ['0176-1714', '1432-217X']

DOI: https://doi.org/10.1007/s00355-022-01402-w